Analytic Modal Revision for Multi-agent Systems

نویسندگان

  • Paolo Di Giusto
  • Guido Governatori
چکیده

We present two models of hierarchical structured multi-agents, and we describe how to obtain a modal knowledge base from distributed sources. We then propose a computationally oriented revision procedure for modal knowledge bases. This procedure is based on a labelled tableaux calculi supplemented with a formalism to record the dependencies of the formulae. The dependencies are then used to reconstruct the minimal inconsistent sets, and the sub-formulae responsible for the inconsistencies are revised according to well-defined chains of modal functions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modal Higher-order Logic for Agents

This paper introduces a modal higher-order logic for representing belief states of agents. The syntax and semantics of the logic and a tableau system for proving theorems are presented and an indication given as to how the logic can be used for building multi-agent systems. The main ideas are illustrated by an extended example concerning a user agent for the Internet.

متن کامل

ar X iv : c s . A I / 02 01 02 0 v 1 23 J an 2 00 2 A Modal Logic Framework for Multi - agent Belief Fusion ∗

This paper is aimed at providing a uniform framework for reasoning about beliefs of multiple agents and their fusion. In the first part of the paper, we develop logics for reasoning about cautiously merged beliefs of agents with different degrees of reliability. The logics are obtained by combining the multi-agent epistemic logic and multi-sources reasoning systems. Every ordering for the relia...

متن کامل

Tableaux for Public Announcement Logic

Public announcement logic extends multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. In this article we propose a labelled tableau calculus for this logic, and show that it decides satisfiability of formulas in deterministic polynomial space. Since this problem is known to be PSPACE-complete, it follows that...

متن کامل

A Decision Procedure for a Temporal Belief Logic

This paper presents a temporal belief logic called LTB. In addition to the usual connectives of linear discrete temporal logic, LTB contains an indexed set of modal belief connectives,via which it is possible to represent the belief systems of resource-bounded reasoning agents. The applications of LTB in general, and its use for representing the dynamic properties of multi-agent AI systems in p...

متن کامل

Taming the Complexity of Temporal Epistemic Reasoning

Temporal logic of knowledge is a combination of temporal and epistemic logic that has been shown to be very useful in areas such as distributed systems, security, and multi-agent systems. However, the complexity of the logic can be prohibitive. We here develop a refined version of such a logic and associated tableau procedure with improved complexity but where important classes of specification...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999